Discrete Adjoint of a fully-implicit coupled solver based on foam-extend using Algorithmic Differentiation
نویسنده
چکیده
Adjoint based methods are an effective way to obtain accurate gradients for CFD optimization problems since the computation cost for the calculation of these gradients is relatively independent of the degrees of freedom. At the heart of such an optimization process lies the computation of topology sensitivity maps. Sensitivities are derivatives of an objective function resulting from CFD computations with respect to meaningful design variables. The existing discrete adjoint version of OpenFOAM [1,2] is obtained by applying Algorithmic Differentiation [3] tool, dco/c++. In this paper, we present the generic adaptation of our existing framework to foam-extend [4]. Further we present our coupled adjoint solver based on pUCoupledFoam [5], an incompressible pressure-velocity coupled solver based on an explicit use of Rhie-Chow interpolation. The discrete approach has the relative advantage of flexibility and robustness compared to continuous adjoint formulations, however at the expense of additional computation cost and memory. These issues are somewhat attended to using standard techniques like checkpointing [6]. However for industrial problems, the long computation time still remains a bottleneck. We are therefore looking to exploit the faster rate of convergence of the flow equations (and hopefully, faster computations) to decrease the overall time for the computation of the sensitivities.
منابع مشابه
A Discrete Adjoint Version of an Unsteady Incompressible Solver for Openfoam Using Algorithmic Differentiation
The comparatively low computational costs of adjoint based gradient methods for optimization problems with a high number of degrees of freedom have allowed them to become one of the most interesting approaches in CFD shape optimization. At the core of such optimization techniques lies the computation of topology sensitivity maps. The two most common approaches for computing adjoint based sensit...
متن کاملAdjoint Algorithmic Differentiation: Calibration and Implicit Function Theorem
Adjoint Algorithmic Differentiation is an efficient way to obtain financial instrument price derivatives with respect to the data inputs. Often the differentiation does not cover the full pricing process when a model calibration is performed. Thanks to the implicit function theorem, the differentiation of the solver embedded in the calibration is not required to differentiate to full pricing pr...
متن کاملMixed Large-Eddy Simulation Model for Turbulent Flows across Tube Bundles Using Parallel Coupled Multiblock NS Solver
In this study, turbulent flow around a tube bundle in non-orthogonal grid is simulated using the Large Eddy Simulation (LES) technique and parallelization of fully coupled Navier – Stokes (NS) equations. To model the small eddies, the Smagorinsky and a mixed model was used. This model represents the effect of dissipation and the grid-scale and subgrid-scale interactions. The fully coupled NS eq...
متن کاملTopological Design Based on Highly Efficient Adjoints Generated by Automatic Differentiation
We report on a proof-of-concept study for the application of an automatically generated adjoint Navier-Stokes code in the automotive design process. The design application consists in the optimisation of the topology of a duct for the cabin ventilation. The numerical model is a three-dimensional Navier-Stokes solver based on Griebel’s NaSt2D. The design approach is based on a descent algorithm,...
متن کاملAlgorithmic Differentiation of Numerical Methods: Second-Order Tangent and Adjoint Solvers for Systems of Parametrized Nonlinear Equations
Forward and reverse modes of algorithmic differentiation (AD) transform implementations of multivariate vector functions F : IR → IR as computer programs into tangent and adjoint code, respectively. The reapplication of the same ideas yields higher derivative code. In particular, second derivatives play an important role in nonlinear programming. Second-order methods based on Newton’s algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014